Multiplication, division, and shift instructions in parallel random access machines

Multiplication, Division and Shift Instructions in Parallel Random Access Machines

Trahan, J.L., M.C. Loui and V. Ramachandran, Multiplication, division and shift instructions in parallel random access machines, Theoretical Computer Science 100 (1992) l-44. We prove that polynomial time on a parallel random access machine (PRAM) with unit-cost multiplication and division or on a PRAM with unit-cost shifts is equivalent to polynomial space on a Turing machine (PSPACE). This ex...

Wideband Code Division and Multiplication Access

When we talk about first generation systems we think about analog cellular systems. The second-generation systems are GSM (Global System for Mobile Communication), PDC (Personal Digital Cellular, 2 nd generation system in Japan), cdmaOne (IS-95) and US-TDMA (IS-136). Third generation systems, which are designed for multimedia communication are to have high quality images and videos and to acces...

Neural Random-Access Machines

In this paper, we propose and investigate a new neural network architecture called Neural Random Access Machine. It can manipulate and dereference pointers to an external variable-size random-access memory. The model is trained from pure input-output examples using backpropagation. We evaluate the new model on a number of simple algorithmic tasks whose solutions require pointer manipulation and...

Relative Cost Random Access Machines

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...